Minimizing makespan for a no-wait flowshop using genetic algorithm
نویسندگان
چکیده
This paper explains minimization of makespan or total completion time for n-jobs, m-machine, no-wait flowshop problem (NW-FSSP). A spread sheet based general purpose genetic algorithm is proposed for the NW-FSSP. The example analysis shows that the proposed approach produces results are comparable to the previous approaches cited in the literature. Additionally, it is demonstrated that the current application is a general purpose approach whereby the objective function can be tailored without any change in the logic of the GA routine.
منابع مشابه
َA Multi-objective simulated annealing algorithm to solving flexible no-wait flowshop scheduling problems with transportation times
This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presen...
متن کاملSolving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm
In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...
متن کاملSolving Re-entrant No-wait Flow Shop Scheduling Problem
In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...
متن کاملA hybrid genetic algorithm for solving no-wait flowshop scheduling problems
A hybrid genetic algorithm is proposed in this paper to minimize the makespan and the total flowtime in the no-wait flowshop scheduling problem, which is known to be NP-hard for more than two machines. The Variable Neighborhood Search is used as an improvement procedure in the last step of the genetic algorithm. First, comparisons are provided with respect to several techniques that are represe...
متن کاملAn Effective Constructive Heuristic for the No-wait Flowshop with Sequence- Dependent Setup times Problem
This paper presents a new heuristic named GAPH based on a structural property for minimizing makespan in no-wait flowshop with sequence-dependent setup times. Experimental results demonstrate the superiority of the proposed approach over thhree of the best-know methods in the literature. Experimental and statistical analyses show that the new heuristic provides better solutions regarding the so...
متن کامل